Proof of Dickson’s Lemma Using the ACL2 Theorem Prover via an Explicit Ordinal Mapping

نویسنده

  • Mátyás Sustik
چکیده

In this paper we present the use of the ACL2 theorem prover to formalize and mechanically check a new proof of Dickson’s lemma about monomial sequences. Dickson’s lemma can be used to establish the termination of Büchberger’s algorithm to find the Gröbner basis of a polynomial ideal. This effort is related to a larger project which aims to develop a mechanically verified computer algebra system.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formal Proof of Dickson's Lemma in ACL2

Dickson’s Lemma is the main result needed to prove the termination of Buchberger’s algorithm for computing Gröbner basis of polynomial ideals. In this case study, we present a formal proof of Dickson’s Lemma using the ACL2 system. Due to the limited expressiveness of the ACL2 logic, the classical non-constructive proof of this result cannot be done in ACL2. Instead, we formalize a proof where t...

متن کامل

An ACL2 Tutorial

We describe a tutorial that demonstrates the use of the ACL2 theorem prover. We have three goals: to enable a motivated reader to start on a path towards effective use of ACL2; to provide ideas for other interactive theorem prover projects; and to elicit feedback on how we might incorporate features of other proof tools into ACL2.

متن کامل

Integrating Testing and Interactive Theorem Proving

Using an interactive theorem prover to reason about programs involves a sequence of interactions where the user challenges the theorem prover with conjectures. Invariably, many of the conjectures posed are in fact false, and users often spend considerable effort examining the theorem prover’s output before realizing this. We present a synergistic integration of testing with theorem proving, imp...

متن کامل

Proving Theorems about Java and the JVM with ACL2

We describe a methodology for proving theorems mechanically about Java methods. The theorem prover used is the ACL2 system, an industrial-strength version of the Boyer-Moore theorem prover. An operational semantics for a substantial subset of the Java Virtual Machine (JVM) has been defined in ACL2. Theorems are proved about Java methods and classes by compiling them with javac and then proving ...

متن کامل

Using Parallelism to Improve Theorem Prover Interactivity

Multi-core CPUs have become commonplace in desktop computers, but theorem provers often do not take advantage of the additional resources these CPUs provide in an interactive setting. This PhD proposal focuses on automatically using these additional resources to lessen the delay between when a user submits a conjecture to the ACL2 theorem prover and when the user receives feedback from the prov...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003